Pseudo-centroid clustering

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo-centroid clustering

Pseudo-Centroid Clustering replaces the traditional concept of a centroid expressed as a center of gravity with the notion of a pseudo-centroid (or a coordinate free centroid) which has the advantage of applying to clustering problems where points do not have numerical coordinates (or categorical coordinates that are translated into numerical form). Such problems, for which classical centroids ...

متن کامل

Generalizing Centroid Index to Different Clustering Models

Centroid index is the only measure that evaluates cluster level differences between two clustering results. It outputs an integer value of how many clusters are differently allocated. In this paper, we apply this index to other clustering models that do not use centroid as prototype. We apply it to centroid model, Gaussian mixture model, and arbitrary-shape clusters.

متن کامل

Redundancy Aware Clustering via Centroid Localization Technique

This paper investigates the energy-saving organization of sensor nodes in large wireless sensor networks. Due to a random deployment used in many application scenarios, much more nodes need to be deployed to achieve a complete sensor coverage than theoretically needed in case of an ideal deployment. Consequently, most of the deployed nodes are redundant and can be switched-off for a long time t...

متن کامل

Pseudo-Boolean clustering

This paper proposes to cluster any finite data set by optimizing with respect to a cluster score function, assigning a positive real worth to each data subset and thereby dealt with in pseudo-Boolean form, so that the multilinear extension (MLE) allows to evaluate fuzzy data subsets or clusters as well. A fuzzy clustering being a collection of fuzzy clusters over which every data point has to d...

متن کامل

Novel centroid selection approaches for KMeans-clustering based recommender systems

Recommender systems have the ability to filter unseen information for predicting whether a particular user would prefer a given item when making a choice. Over the years, this process has been dependent on robust applications of data mining and machine learning techniques, which are known to have scalability issues when being applied for recommender systems. In this paper, we propose a k-means ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2016

ISSN: 1432-7643,1433-7479

DOI: 10.1007/s00500-016-2369-6